Minimal-distance Routing for Kyklos Ii
نویسندگان
چکیده
We propose a new routing strategy for the KYKLOS II multiprocessor interconnection network which achieves minimum distance for the path between any two processors. For KYKLOS II with 2 processors, the average distance is shorter than those of previous routing strategies by approximately 2 log 2 n. The traffic density, a measure of traffic concentration, is comparable or better than previous strategies for up to two thousand processors, but is soundly beaten by a strategy proposed by Jenevein and Menezes for larger n. MINIMAL-DISTANCE ROUTING FOR KYKLOS II D. Z. Du F. K. Hwang & A. M. Odlyzko Y. J. Zhang MIT AT&T Bell Laboratories University of California Cambridge, Mass. Murray Hill, NJ Berkeley, CA
منابع مشابه
A Memetic Algorithm for the Vehicle Routing Problem with Cross Docking
In this paper we address the VRPCD, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. The products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. The objective of the VRPCD is to minimize the total traveled distance while respe...
متن کاملEvolutionary Approach for Energy Minimizing Vehicle Routing Problem with Time Windows and Customers’ Priority
A new model and solution for the energy minimizing vehicle routing problem with time windows (EVRPTW) and customers’ priority is presented in this paper. In this paper unlike prior attempts to minimize cost by minimizing overall traveling distance, the model also incorporates energy minimizing which meets the latest requirements of green logistics. This paper includes the vehicles load as an ad...
متن کاملA Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کاملEfficient Broadcasting in MANETs by Selective Forwarding
A major challenge faced in mobile ad hoc networks (MANETs) is locating devices for communication, especially in the case of high node mobility and sparse node density. Present solutions provided by the ad hoc routing protocols range from flooding the entire network with route requests, to deploying a separate location management scheme to maintain a device location database. Many applications a...
متن کاملNew mathematical modeling for a location–routing–inventory problem in a multi-period closed-loop supply chain in a car industry
This paper studies a location–routing–inventory problem in a multi-period closed-loop supply chain with multiple suppliers, producers, distribution centers, customers, collection centers, recovery, and recycling centers. In this supply chain, centers are multiple levels, a price increase factor is considered for operational costs at centers, inventory and shortage (including lost sales and back...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998